An Analysis of a Hybrid Evolutionary Algorithm by means of its Phylogenetic Information

The study conducted in this work analyses the interactions between different Evolutionary Algorithms when they are hybridized. For this purpose, the phylogenetic tree of the best solution reported by the hybrid algorithm is reconstructed, and the relationships among the ancestors of this solution are established. For each of these ancestors, the evolutionary techniques that generated that solution and the fitness increment introduced compared to its parents are recorded. The study reveals a structured interaction among the different evolutionary techniques that makes the hybrid algorithm to outperform each of its composing algorithms when executed individually. The Multiple Offspring Sampling framework has been used to develop the Hybrid EA studied in this work and the experiments have been conducted on the well-known CEC 2005 Benchmark for continuous optimizatio

Benchmarking a MOS-based algorithm on the BBOB-2010 noiseless function testbed

In this contribution, a hybrid algorithm combining Differential Evolution and IPOP-CMA-ES is presented and benchmarked on the BBOB 2010 noiseless testbed. The hybrid algorithm has been constructed within the Multiple Offspring Sampling framework, which allows the seamless combination of multiple metaheuristics in a dynamic algorithm capable of adjusting the participation of each of the composing algorithms according to their current performance. The experimental results show a robust behavior of the algorithm and a good scalability as the dimensionality increases

Automatically Modeling Hybrid Evolutionary Algorithms from Past Executions

ection of the most appropriate Evolutionary Algorithm for a given optimization problem is a difficult task. Hybrid Evolutionary Algorithms are a promising alternative to deal with this problem. By means of the combination of different heuristic optimization approaches, it is possible to profit from the benefits of the best approach, avoiding the limitations of the others. Nowadays, there is an active research in the design of dynamic or adaptive hybrid algorithms. However, little research has been done in the automatic learning of the best hybridization strategy. This paper proposes a mechanism to learn a strategy based on the analysis of the results from past executions. The proposed algorithm has been evaluated on a well-known benchmark on continuous optimization. The obtained results suggest that the proposed approach is able to learn very promising hybridization strategies

A computational model coupling mechanics and electrophysiology in spinal cord injury

Traumatic brain injury and spinal cord injury have recently been put under the spotlight as major causes of death and disability in the developed world. Despite the important ongoing experimental and modeling campaigns aimed at understanding the mechanics of tissue and cell damage typically observed in such events, the differenti- ated roles of strain, stress and their corresponding loading rates on the damage level itself remain unclear. More specif- ically, the direct relations between brain and spinal cord tis- sue or cell damage, and electrophysiological functions are still to be unraveled. Whereas mechanical modeling efforts are focusing mainly on stress distribution and mechanistic- based damage criteria, simulated function-based damage cri- teria are still missing. Here, we propose a new multiscale model of myelinated axon associating electrophysiological impairment to structural damage as a function of strain and strain rate. This multiscale approach provides a new framework for damage evaluation directly relating neuron mechanics and electrophysiological properties, thus provid- ing a link between mechanical trauma and subsequent func- tional deficits

Minimal Decision Rules Based on the A Priori Algorithm

Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensi- ble (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our ap- proach, in a post-processing stage, we apply the Apriori algorithm to reduce the decision rules obtained through rough sets. The set of dependencies thus obtained will help us discover irrelevant attribute values

Migrating Individuals and Probabilistic Models on DEDAS: a Comparison on Continuous Functions

One of the most promising areas in which probabilistic graphical models have shown an incipient activity is the field of heuristic optimization and, in particular, in the Estimation of Distribution Algorithms (EDAs). EDAs constitute a well-known family of Evolutionary Computation techniques, similar to Genetic Algorithms. Due to their inherent parallelism, different research lines have been studied trying to improve EDAs from the point of view of execution time and/or accuracy. Among these proposals, we focus on the so-called island-based models. This approach defines several islands (EDA instances) running independently and exchanging information with a given frequency. The information sent by the islands can be a set of individuals or a probabilistic model. This paper presents a comparative study of both information exchanging techniques for a univariate EDA (U M DAg) over a wide set of parameters and problems –the standard benchmark developed for the IEEE Workshop on Evolutionary Algorithms and other Metaheuristics for Continuous Optimization Problems of the ISDA 2009 Conference. The study concludes that the configurations based on migrating individuals obtain better result

On the evaluation of information exchange strategies in dEDAs

One of the most promising areas in which probabilistic graphical models have shown an incipient activity is the field of heuristic optimization and, in particular, in the Estimation of Distribution Algorithms (EDAs). EDAs constitute a well-known family of Evolutionary Computation techniques, similar to Genetic Algorithms. Due to their inherent parallelism, different research lines have tried to improve EDAs from the point of view of execution time and/or accuracy. Among these proposals, we focus on the so-called island-based models. This approach defines several islands (EDA instances) running independently and exchanging information with a given frequency. The information sent by the islands can be a set of individuals or a probabilistic model. This paper presents a comparative study of both information exchanging techniques for a univariate EDA (UMDAg) over a wide set of parameters and problems –the standard benchmark developed for the IEEE Workshop on Evolutionary Algorithms and other Metaheuristics for Continuous Optimization Problems of the ISDA 2009 Conference

Neurite, a finite difference large scale parallel program for the simulation of the electrical signal propagation in neurites under mechanical loading

With the growing body of research on traumatic brain injury and spinal cord injury, computational neuroscience has recently focused its modeling efforts on neuronal functional deficits following mechanical loading. However, in most of these efforts, cell damage is generally only characterized by purely mechanistic criteria, function of quantities such as stress, strain or their corresponding rates. The modeling of functional deficits in neurites as a consequence of macroscopic mechanical insults has been rarely explored. In particular, a quantitative mechanically based model of electrophysiological impairment in neuronal cells has only very recently been proposed (Jerusalem et al., 2013). In this paper, we present the implementation details of Neurite: the finite difference parallel program used in this reference. Following the application of a macroscopic strain at a given strain rate produced by a mechanical insult, Neurite is able to simulate the resulting neuronal electrical signal propagation, and thus the corresponding functional deficits. The simulation of the coupled mechanical and electrophysiological behaviors requires computational expensive calculations that increase in complexity as the network of the simulated cells grows. The solvers implemented in Neurite-explicit and implicit-were therefore parallelized using graphics processing units in order to reduce the burden of the simulation costs of large scale scenarios. Cable Theory and Hodgkin-Huxley models were implemented to account for the electrophysiological passive and active regions of a neurite, respectively, whereas a coupled mechanical model accounting for the neurite mechanical behavior within its surrounding medium was adopted as a link between lectrophysiology and mechanics (Jerusalem et al., 2013). This paper provides the details of the parallel implementation of Neurite, along with three different application examples: a long myelinated axon, a segmented dendritic tree, and a damaged axon. The capabilities of the program to deal with large scale scenarios, segmented neuronal structures, and functional deficits under mechanical loading are specifically highlighted

3D segmentations of neuronal nuclei from confocal microscope image stacks

In this paper, we present an algorithm to create 3D segmentations of neuronal cells from stacks of previously segmented 2D images. The idea behind this proposal is to provide a general method to reconstruct 3D structures from 2D stacks, regardless of how these 2D stacks have been obtained. The algorithm not only reuses the information obtained in the 2D segmentation, but also attempts to correct some typical mistakes made by the 2D segmentation algorithms (for example, under segmentation of tightly-coupled clusters of cells). We have tested our algorithm in a real scenario?the segmentation of the neuronal nuclei in different layers of the rat cerebral cortex. Several representative images from different layers of the cerebral cortex have been considered and several 2D segmentation algorithms have been compared. Furthermore, the algorithm has also been compared with the traditional 3D Watershed algorithm and the results obtained here show better performance in terms of correctly identified neuronal nuclei

Impact of obstructive sleep apnea on the levels of placental growth factor (PlGF) and their value for predicting short-term adverse outcomes in patients with acute coronary syndrome

Background Placental growth factor (PlGF) induces angiogenesis and promotes tissue repair, and plasma PlGF levels change markedly during acute myocardial infarction (AMI). Currently, the impact of obstructive sleep apnea (OSA) in patients with AMI is a subject of debate. Our objective was to evaluate the relationships between PlGF levels and both the severity of acute coronary syndrome (ACS) and short-term outcomes after ACS in patients with and without OSA. Methods A total of 538 consecutive patients (312 OSA patients and 226 controls) admitted for ACS were included in this study. All patients underwent polygraphy in the first 72 hours after hospital admission. The severity of disease and short-term prognoses were evaluated during the hospitalization period. Plasma PlGF levels were measured using an electrochemiluminescence immunoassay. Results Patients with OSA were significantly older and more frequently hypertensive and had higher BMIs than those without OSA. After adjusting for age, smoking status, BMI and hypertension, PlGF levels were significantly elevated in patients with OSA compared with patients without OSA (19.9 pg/mL, interquartile range: 16.6–24.5 pg/mL; 18.5 pg/mL, interquartile range: 14.7–22.7 pg/mL; p<0.001), and a higher apnea-hypopnea index (AHI) was associated with higher PlGF concentrations (p<0.003). Patients with higher levels of PlGF had also an increased odds ratio for the presence of 3 or more diseased vessels and for a Killip score>1, even after adjustment. Conclusions The results of this study show that in patients with ACS, elevated plasma levels of PlGF are associated with the presence of OSA and with adverse outcomes during short-term followup. Trial Registration ClinicalTrials.gov NCT0133508